翻訳と辞書
Words near each other
・ Bhrigu Samhita
・ Bhrigu Vanshiya Brahmins
・ Bhrigus
・ Bhrikuti
・ Bhrikuti Municipality
・ Bhringesvara Siva Temple
・ Bhringi
・ Bhrngadutam
・ Bhrugu Baxipatra
・ Bhrugubanda
・ Bhrukutesvar Siva Temple
・ BHS
・ BHSF
・ BHT
・ BHT 1
BHT algorithm
・ BHTec
・ BHU
・ Bhu Varaha Swamy temple
・ Bhuapur Upazila
・ Bhubal
・ Bhuban
・ Bhubanananda Das
・ Bhubanananda Orissa School of Engineering, Cuttack
・ Bhubaneshwar-Visakhapatnam Intercity Express
・ Bhubaneswar
・ Bhubaneswar (Lok Sabha constituency)
・ Bhubaneswar Behera
・ Bhubaneswar Behera Auditorium
・ Bhubaneswar BRTS


Dictionary Lists
翻訳と辞書 辞書検索 [ 開発暫定版 ]
スポンサード リンク

BHT algorithm : ウィキペディア英語版
BHT algorithm
The BHT algorithm is a quantum algorithm that solves the collision problem. In this problem, one is given ''n'' and an ''r''-to-1 function f:\,\\rightarrow\ and needs to find two inputs that ''f'' maps to the same output. The BHT algorithm only makes O(n^) queries to ''f'', which matches the lower bound of \Omega(n^) in the black box model.〔
〕〔

The algorithm was discovered by Brassard, Hoyer, and Tapp in 1997. It uses Grover's algorithm, which was discovered in the previous year.
==Algorithm==
Intuitively, the algorithm combines the square root speedup from the birthday paradox using (classical) randomness with the square root speedup from Grover's (quantum) algorithm.
First, ''n''1/3 inputs to ''f'' are selected at random and ''f'' and is queried at all of them. If there is a collision among these inputs, then we return the colliding pair of inputs. Otherwise, all the these inputs map to distinct values by ''f''. Then Grover's algorithm is used to find a new input to ''f'' that collides. Since there are only ''n''2/3 such inputs to ''f'', Grover's algorithm can find one (if it exists) by making only O(\sqrt) queries to ''f''.

抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)
ウィキペディアで「BHT algorithm」の詳細全文を読む



スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース

Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.